On Newton's Method for the Fermat-Weber Location Problem

نویسندگان

  • Simone Görner
  • Christian Kanzow
چکیده

This paper considers the Fermat-Weber location problem. It is shown that, after a suitable initialization, the standard Newton method can be applied to the Fermat-Weber problem and is globally and locally quadratically convergent. A numerical comparison with the popular Weiszfeld algorithm shows that Newton’s method is significantly more efficient than the Weiszfeld scheme.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Newton Bracketing method for the minimization of convex functions subject to affine constraints

The Newton Bracketing method [9] for the minimization of convex functions f : Rn → R is extended to affinely constrained convex minimization problems. The results are illustrated for affinely constrained Fermat–Weber location problems.

متن کامل

Solving single facility goal Weber location problem using stochastic optimization methods

Location theory is one of the most important topics in optimization and operations research. In location problems, the goal is to find the location of one or more facilities in a way such that some criteria such as transportation costs, customer traveling distance, total service time, and cost of servicing are optimized. In this paper, we investigate the goal Weber location problem in which the...

متن کامل

The Newton Bracketing Method for Convex Minimization

An iterative method for the minimization of convex functions f : R → R, called a Newton Bracketing (NB) method, is presented. The NB method proceeds by using Newton iterations to improve upper and lower bounds on the minimum value. The NB method is valid for n = 1, and in some cases for n > 1 (sufficient conditions given here). The NB method is applied to large scale Fermat–Weber location probl...

متن کامل

A projected Weiszfeld algorithm for the box-constrained Weber location problem

The Fermat-Weber problem consists in finding a point in R that minimizes the weighted sum of distances from m points in R that are not collinear. An application that motivated this problem is the optimal location of industries in the 2-dimensional case. The Weber problem is a generalization of the well-known Fermat problem. An usual method to solve the Weber problem, proposed by Weiszfeld in 19...

متن کامل

The three-dimensional Fermat-Weber problem with Tchebychev distances

The three-dimensional Fermat-Weber facility location problem with Tchebychev distances is investigated. Expanding on previous research for the analogous two-dimensional problem, this study presents a new algorithm for solving the elusive three-dimensional case. The algorithm presented herein finds near optimal solutions in practical computational times. Some experimental results are also convey...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Optimization Theory and Applications

دوره 170  شماره 

صفحات  -

تاریخ انتشار 2016